Selecting energy efficient inputs using graph structure

Selecting appropriate inputs for systems described by complex networks is an important but difficult problem that largely remains open in the field of control networks. Recent work has proposed two methods energy efficient input selection; a gradient-based heuristic and greedy approximation algorithm. We propose here alternative method selection based on analytic solution controllability Gramian ‘balloon graph’, special model graph captures role both distance redundant paths between driver node target node. The presented especially applicable large where one interested controlling only small number outputs, or nodes, which current may not be practical because they require computing typically very ill-conditioned matrix, called Gramian. Our produces comparable results to previous while being more computational efficient.